Combinatorial Number Theory
نویسنده
چکیده
Background. The integer distance graph G(Z, D) with distance set D = {d1, d2, . . .} has the set of integers Z as the vertex set and two vertices x, y ∈ Z are adjacent if and only if |x − y| ∈ D. The integer distance graphs (under Euclidean norm) were first systematically studied by Eggleton–Erdős–Skilton in 1985 [12, 13], and have been investigated in many ways [50, 56, 57, 61]. One of main goals in these problems is characterizing prescribed distance sets that make the corresponding distance graphs to have finite chromatic number. Ruzsa, Tuza, and Voigt [50] gave a sufficient condition for χ(G(Z, D)) to be finite:
منابع مشابه
A convex combinatorial property of compact sets in the plane and its roots in lattice theory
K. Adaricheva and M. Bolat have recently proved that if $,mathcal U_0$ and $,mathcal U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $jin {0,1,2}$ and $kin{0,1}$ such that $,mathcal U_{1-k}$ is included in the convex hull of $,mathcal U_kcup({A_0,A_1, A_2}setminus{A_j})$. One could say disks instead of circles.Here we prove the existence of such a $j$ and $k$ ...
متن کاملSome combinatorial aspects of finite Hamiltonian groups
In this paper we provide explicit formulas for the number of elements/subgroups/cyclic subgroups of a given order and for the total number of subgroups/cyclic subgroups in a finite Hamiltonian group. The coverings with three proper subgroups and the principal series of such a group are also counted. Finally, we give a complete description of the lattice of characteristic subgroups of a finite H...
متن کاملA Deterministic Multiple Key Space Scheme for Wireless Sensor Networks via Combinatorial Designs
The establishing of a pairwise key between two nodes for encryption in a wireless sensor network is a challenging issue. To do this, we propose a new deterministic key pre-distribution scheme which has modified the multiple key space scheme (MKSS). In the MKSS, the authors define two random parameters to make better resilience than existing schemes. Instead of a random selection of these parame...
متن کاملJeong - Hyun
My research interests lie in Discrete Mathematics, especially Combinatorics, Graph Theory, Combinatorial Geometry, and Combinatorial Number Theory. For me, the most exciting aspect of working in discrete mathematics is the prevalence of combinatorial problems in various fields of mathematics and various applications to Computer Science and real life problems such as building transmitters in a t...
متن کاملResearch Statement Jeong -
My research interests lie in Discrete Mathematics, especially Combinatorics, Graph Theory, Combinatorial Geometry, and Combinatorial Number Theory. For me, the most exciting aspect of working in discrete mathematics is the prevalence of combinatorial problems in various fields of mathematics and various applications to Computer Science and real life problems such as building transmitters in a t...
متن کاملGroups in Combinatorial Number Theory
In combinatorial number theory, there are many topics related to group structure. Even for abelian or cyclic groups, there are some very challenging unsolved conjectures. In this talk we give a survey of problems, results and methods in several fields of combinatorial number theory. The topics include sumsets in additive combinatorics, Snevily’s conjecture and Latin transversals, covers of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007